Pii: S0925-7721(01)00027-x
نویسندگان
چکیده
For a set P of points in the plane, we introduce a class of triangulations that is an extension of the Delaunay triangulation. Instead of requiring that for each triangle the circle through its vertices contains no points of P inside, we require that at most k points are inside the circle. Since there are many different higher-order Delaunay triangulations for a point set, other useful criteria for triangulations can be incorporated without sacrificing the well-shapedness too much. Applications include realistic terrain modeling and mesh generation. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Pii: S0925-7721(01)00015-3
In this paper we present a heuristic to reconstruct nonsmooth curves with multiple components. Experiments with several input data reveals the effectiveness of the algorithm in contrast with the other competing algorithms. 2001 Elsevier Science B.V. All rights reserved.
متن کاملPii: S0925-7721(01)00044-x
We present two algorithms for packing two largest disks in a polygon. The first algorithm locates two disks in a simple polygon in time O(n log2 n) improving the best previous deterministic result (Bespamyatnikh, 1999) by a factor of logn. The second algorithm finds two disks in a convex polygon such that the disks are separated by a diagonal of the polygon. It runs in time O(n log2 n) improvin...
متن کاملPii: S0925-7721(01)00068-2
Reconstruction of polygons from visibility information is known to be a difficult problem in general. In this paper, we consider a special case: reconstruction of orthogonal polygons from horizontal and vertical visibility information and show that this reconstruction can be performed in O(n logn) time. 2002 Elsevier Science B.V. All rights reserved.
متن کاملPolygonal chains cannot lock in 4d
We prove that, for all dimensions d 4, every simple open polygonal chain may be straightened, and every simple closed polygonal chain may be convexi ed. Both can be achieved by algorithms that use polynomial time in the number of vertices, and result in a polynomial number of \moves." These results contrast to those known for d = 3, where open and closed chains can be \locked."
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002